A Q-Learning Rescheduling Approach to the Flexible Job Shop Problem Combining Energy and Productivity Objectives

نویسندگان

چکیده

The flexible job shop problem (FJSP) has been studied in recent decades due to its dynamic and uncertain nature. Responding a system’s perturbation an intelligent way with minimum energy consumption variation is important matter. Fortunately, thanks the development of artificial intelligence machine learning, lot researchers are using these new techniques solve rescheduling shop. Reinforcement which popular approach intelligence, often used rescheduling. This article presents Q-learning combining productivity objectives context failure. First, genetic algorithm was adopted generate initial predictive schedule, then strategies were developed handle failures. As system should be capable reacting quickly unexpected events, multi-objective proposed trained select optimal methods that minimize makespan at same time. conducted on benchmark instances evaluate performance.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Cellular Learning Automata (CLA) Approach to Job Shop Scheduling Problem

Job shop scheduling problem (JSSP), as one of the NP-Hard combinatorial optimization problems, has attracted the attention of many researchers during the last four decades. The overall purpose regarding this problem is to minimize maximum completion time of jobs, known as makespan. This paper addresses an approach to evolving Cellular Learning Automata (CLA) in order to enable it to solve the J...

متن کامل

Solving Flexible Job Shop Scheduling with Multi Objective Approach

  In this paper flexible job-shop scheduling problem (FJSP) is studied in the case of optimizing different contradictory objectives consisting of: (1) minimizing makespan, (2) minimizing total workload, and (3) minimizing workload of the most loaded machine. As the problem belongs to the class of NP-Hard problems, a new hybrid genetic algorithm is proposed to obtain a large set of Pareto-optima...

متن کامل

Partial Order Backtracking Based Job Shop Rescheduling

We present here a discipline for job shop rescheduling based on partial order backtracking. We show that partial order backtracking ooers the rescheduler a framework for schedule repair, based upon a set of nogoods, which impose a systematic partial order on the set of activities to be repaired but allows non systematic techniques to be used within that framework. We present rescheduling as par...

متن کامل

An integrated approach for scheduling flexible job-shop using teaching–learning-based optimization method

In this paper, teaching–learning-based optimization (TLBO) is proposed to solve flexible job shop scheduling problem (FJSP) based on the integrated approach with an objective to minimize makespan. An FJSP is an extension of basic job-shop scheduling problem. There are two sub problems in FJSP. They are routing problem and sequencing problem. If both the sub problems are solved simultaneously, t...

متن کامل

A New model for integrated lot sizing and scheduling in flexible job shop problem

In this paper an integrated lot-sizing and scheduling problem in a flexible job shop environment with machine-capacity-constraint is studied. The main objective is to minimize the total cost which includes the inventory costs, production costs and the costs of machine’s idle times. First, a new mixed integer programming model,with small bucket time approach,based onProportional Lot sizing and S...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Sustainability

سال: 2021

ISSN: ['2071-1050']

DOI: https://doi.org/10.3390/su132313016